package com.faiz.algorithm;

public class TreeLevel {
    public static int solution(BinaryTree node) {
        if (node == null) {
            return 0;
        }
        return Math.max(solution(node.getLeft()), solution(node.getRight())) + 1;
    }
}
